Mathematical Foundations of Logic and Functional Programming
نویسنده
چکیده
As an introduction, we give some examples of logic programs and the intended semantics of them. A logic program is simply a (not necessarily finite!) set of program clauses. That is, there is no particular ordering of the clauses as in the case, say, imperative programs: a program here is just a set of constraints, a set of logical formulas describing the world in which the programming environment tries to derive facts, from a set of known facts, applying a set of inference rules.
منابع مشابه
Functional Logic Programming: From Theory to Curry
Functional logic programming languages combine the most important declarative programming paradigms, and attempts to combine these paradigms have a long history. The declarative multi-paradigm language Curry is influenced by recent advances in the foundations and implementation of functional logic languages. The development of Curry is an international initiative intended to provide a common pl...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملClassical Combinatory Logic
Combinatory logic shows that bound variables can be eliminated without loss of expressiveness. It has applications both in the foundations of mathematics and in the implementation of functional programming languages. The original combinatory calculus corresponds to minimal implicative logic written in a system “à la Hilbert”. We present in this paper a combinatory logic which corresponds to pro...
متن کاملNotes on Predicate Calculus and Logic Programming
[1] Apt, K. R.: Logic Programming, Handbook of Theoretical Computer Science (J. van Leeuwen, ed.), Elsevier Science Publishers B.V., 1990. [2] Chang, C.-L. and Lee, R. C.-T.: Symbolic Logic and Mechanical Theorem Proving, Academic Press Inc., 1973. [3] Kowalski, R.: Logic for Problem Solving, North Holland, 1979. [4] Lloyd, J. W.: Foundations of Logic Programming, 2nd Edition, Springer Verlag, ...
متن کاملLogical Reasoning about Programming of Mathematical Machines
We always start the solving of a problem with the formulation of its theoretical foundations. If we would like to use mathematical machines (computers) in problem solving, we need to formalize its theoretical foundations as logical reasoning because the programs should really prove the correctness of their results. In our paper we present central ideas of our approach regarding programming as l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016